On Iterative Calculation of Moore-Penrose Laplacian and Resistance Distance
نویسندگان
چکیده
A large body of network-related problems can be formulated or explained by Moore-Penrose inverse of the graph Laplacian matrix of the network. This paper studies the impact of overlaying or removing a subgraph (inserting / removing a group of links, or modifying a set of link weights) on MoorePenrose inverse of the Laplacian matrix of an existing network topology. Moreover, an iterative method is proposed to find point-to-point resistance distance and network criticality of a graph as a key performance measure to study the robustness of a network when we have link insertion and/or link removal.
منابع مشابه
Modeling Collaborative Similarity with the Signed Resistance Distance Kernel
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is a graph kernel inspired by electrical network models where edges of a graph are interpreted as electrical resistances. We model the similarity between users of a large collaborative rating database using this signed ...
متن کاملAn Efficient Schulz-type Method to Compute the Moore-Penrose Inverse
A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.
متن کاملM-Matrix Inverse problem for distance-regular graphs
We analyze when the Moore–Penrose inverse of the combinatorial Laplacian of a distance– regular graph is a M–matrix; that is, it has non–positive off–diagonal elements. In particular, our results include some previously known results on strongly regular graphs.
متن کاملThe reverse order law for Moore-Penrose inverses of operators on Hilbert C*-modules
Suppose $T$ and $S$ are Moore-Penrose invertible operators betweenHilbert C*-module. Some necessary and sufficient conditions are given for thereverse order law $(TS)^{ dag} =S^{ dag} T^{ dag}$ to hold.In particular, we show that the equality holds if and only if $Ran(T^{*}TS) subseteq Ran(S)$ and $Ran(SS^{*}T^{*}) subseteq Ran(T^{*}),$ which was studied first by Greville [{it SIAM Rev. 8 (1966...
متن کاملOn Connected Bi-partitions of a Graph
We explore the connected bi-partitions of a graph i.e. spanning subgraphs of a graph which consist of exactly two connected components. We then relate the bi-partitions to the elements of the Moore-Penrose pseudoinverse of the graph Laplacian (L). Moreover, we establish a topological interpretation for the effective resistance metric and the so called Kirchoff index for the graph in terms of th...
متن کامل